Markov Analysis

Markov Analysis
A method used to forecast the value of a variable whose future value is independent of its past history. The technique is named after Russian mathematician Andrei Andreyevich Markov, who pioneered the study of stochastic processes, which are processes that involve the operation of chance. The Markov Analysis introduces a method for forecasting random variables.

Markov analysis has a number of applications in the business world. Two common applications are in estimating the proportion of a company's accounts receivables that will become bad debts and forecasting future brand loyalty of current customers.


Investment dictionary. . 2012.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Markov Processes International — Markov Processes International, LLC Type Private Founded 1990 Founders Michael Markov, Mik Kvitchko Headquarters Summit, NJ, United States Industry Financial Services, Software Provider Websi …   Wikipedia

  • Markov perfect equilibrium — A solution concept in game theory Relationships Subset of Subgame perfect equilibrium Significance Proposed by …   Wikipedia

  • Markov's principle — Markov s principle, named after Andrey Markov Jr, is a classical tautology that is not intuitionistically valid but that may be justified by constructive means. There are many equivalent formulations of Markov s principle. Contents 1 Statements… …   Wikipedia

  • Markov's inequality — gives an upper bound for the measure of the set (indicated in red) where f(x) exceeds a given level . The bound combines the level with the average value of f …   Wikipedia

  • Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

  • Markov chain Monte Carlo — MCMC redirects here. For the organization, see Malaysian Communications and Multimedia Commission. Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods) are a class of algorithms for sampling from probability… …   Wikipedia

  • Markov brothers' inequality — In mathematics, the Markov brothers inequality is an inequality proved by Andrey Markov and Vladimir Markov. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial.[1] For k …   Wikipedia

  • Markov random field — A Markov random field, Markov network or undirected graphical model is a set of variables having a Markov property described by an undirected graph. A Markov random field is similar to a Bayesian network in its representation of dependencies. It… …   Wikipedia

  • Markov process — In probability theory and statistics, a Markov process, named after the Russian mathematician Andrey Markov, is a time varying random phenomenon for which a specific property (the Markov property) holds. In a common description, a stochastic… …   Wikipedia

  • Markov chain mixing time — In probability theory, the mixing time of a Markov chain is the time until the Markov chain is close to its steady state distribution. More precisely, a fundamental result about Markov chains is that a finite state irreducible aperiodic chain has …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”